Bruhat Order on Partial Fixed Point Free Involutions
نویسندگان
چکیده
منابع مشابه
Bruhat Order on Partial Fixed Point Free Involutions
Our purpose in this article is to investigate the order complex of inclusion poset PFn of Borel orbit closures in skew-symmetric matrices. We prove that PFn is an EL-shellable poset and furthermore its order complex triangulates a ball. We investigate (rook-theoretic) combinatorial properties of the rank-generating function of PFn in contrast with the zeta function of the variety of skew-symmet...
متن کاملBruhat Order on Fixed-point-free Involutions in the Symmetric Group
We provide a structural description of Bruhat order on the set F2n of fixed-pointfree involutions in the symmetric group S2n which yields a combinatorial proof of a combinatorial identity that is an expansion of its rank-generating function. The decomposition is accomplished via a natural poset congruence, which yields a new interpretation and proof of a combinatorial identity that counts the n...
متن کاملFixed point free involutions on Riemann surfaces
Involutions without fixed points on hyperbolic closed Riemann surface are discussed. Notably, the following question is answered: for τ such an involution on a surface (S, d), can a point p be chosen so that d(p, τ(p)) is bounded by a constant dependent solely on the genus of S? This is proved to be true for even genus and false otherwise. Furthermore, the sharp constant is given in genus 2.
متن کاملFixed Point Free Involutions and Equivariant Maps
1. Preliminaries. We are concerned with involutions without fixed points, together with equivariant maps connecting such involutions. An involution T is a homeomorphism of period 2 of a Hausdorff space X onto itself; that is, T(x) = x for all x £ X . There is associated with an involution T on X the orbit space X/T, obtained by identifying x with T(x) for all x G Z . Denote by v\ X—+X/T the dec...
متن کاملGeneralised Ramsey numbers and Bruhat order on involutions
This thesis consists of two papers within two different areas of combinatorics. Ramsey theory is a classic topic in graph theory, and Paper A deals with two of its most fundamental problems: to compute Ramsey numbers and to characterise critical graphs. More precisely, we study generalised Ramsey numbers for two sets Γ1 and Γ2 of cycles. We determine, in particular, all generalised Ramsey numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/4396